| 翻訳と辞書 |
wheel graph
In the mathematical discipline of graph theory, a wheel graph ''W''''n'' is a graph with ''n'' vertices (n ≥ 4), formed by connecting a single vertex to all vertices of an (''n''-1)-cycle. The numerical notation for wheels is used inconsistently in the literature: some authors instead use ''n'' to refer to the length of the cycle, so that their ''W''''n'' is the graph we denote ''W''''n+1''. A wheel graph can also be defined as the 1-skeleton of an (''n''-1)-gonal pyramid.
==Set-builder construction==
Given a vertex set of , the edge set of the wheel graph can be represented in set-builder notation by .
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「wheel graph」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|